A General Method for Deflection Worm Routing on Meshes Based on Packet Routing Algorithms

On De ection Worm Routing on Meshes

In this paper, we consider the de ection worm routing problem on two dimensional n nmeshes. Our results include: (i) an o -line algorithm for routing permutations in O(kn) steps, and (ii) a general method to obtain de ection worm routing algorithms from packet routing algorithms.

A Note on Deflection Worm Routing on Meshes

We prove the existence of asymptotically optimal routing schedules for deflection worm routing of permutations on n× n meshes. We achieve this by deriving an off-line algorithm which routes permutations in O(kn) steps where k is the number of flits of a worm. The best to date off-line algorithms for deflection worm routing of permutations were due to Newman and Schuster (1995) and Sibeyn and Ka...

Worm-Hole Gossiping on Meshes

Several algorithms for performing gossiping on one-and higher dimensional meshes are presented. As a routing model, we assume the practically important worm-hole routing. For one-dimensional arrays, we give a novel lower bound and an asymptotically optimal gossiping algorithm. For two-dimensional meshes, we present a simple algorithm composed of one-dimensional phases. For an important range of...

On Deflection Worm Routing on Meshes

Routing Improvement for Vehicular Ad Hoc Networks (VANETs) Using Nature Inspired Algorithms

are a subset of MANETs in which vehicles are considered as network clients. These networks have been created to communicate between vehicles and traffic control on the roads. have similar features to MANETs and their main special property is the high-speed node mobility which makes a quick change of the network. The rapid change of network topology is a major challenge in routing. One of the we...